Planning a multi-sensors search for a moving target considering traveling costs

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

Efficient Multi-robot Search for a Moving Target

This paper examines the problem of locating a mobile, non-adversarial target in an indoor environment using multiple robotic searchers. One way to formulate this problem is to assume a known environment and choose searcher paths most likely to intersect with the path taken by the target. We refer to this as the Multi-robot Efficient Search Path Planning (MESPP) problem. Such path planning probl...

A hierarchical approach for planning a multisensor multizone search for a moving target

Available online 22 August 2008

Optimal Whereabouts Search for a Moving Target

a novel navigation method for pursuing a moving target

the most current pursuit algorithms for moving targets which are presented so far in the literatureare pure pursuit and pure rendezvous navigations. recently, one of the present authors has introduced ageometric model for the pure pursuit navigation algorithm. here, in this paper, we study a new algorithm forthe pursuit navigation problem which is a combination of both of the above algorithms. ...